Hybridized Paracomplete and Paraconsistent Logics
نویسندگان
چکیده
منابع مشابه
Literal-paraconsistent and literal-paracomplete matrices
We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of all these matrices, we give conditions for the maximality of these logics and we study in detail ...
متن کاملAlgebraization of logics defined by literal-paraconsistent or literal-paracomplete matrices
We study the algebraizability of the logics constructed using literal-paraconsistent and literal-paracomplete matrices described by Lewin and Mikenbergin[11] proving that theyare all algebraizable in the sense of Blok We study the algebraizability of the logics constructed using literal-paraconsistent and literal-paracomplete matrices described by Lewin and Mikenberg in [11], proving that they ...
متن کاملParaconsistent Logics!
In this note I respond to Hartley Slater's argument [12] to the e ect that there is no such thing as paraconsistent logic. Slater's argument trades on the notion of contradictoriness in the attempt to show that the negation of paraconsistent logics is merely a subcontrary forming operator and not one which forms contradictories. I will show that Slater's argument fails, for two distinct reasons...
متن کاملNegation and Paraconsistent Logics
Does there exist any equivalence between the notions of inconsistency and consequence in paraconsistent logics as is present in the classical two valued logic? This is the key issue of this paper. Starting with a language where negation (¬) is the only connective, two sets of axioms for consequence and inconsistency of paraconsistent logics are presented. During this study two points have come ...
متن کاملParaconsistent Modal Logics
We introduce a modal expansion of paraconsistent Nelson logic that is also as a generalization of the Belnapian modal logic recently introduced by Odintsov and Wansing. We prove algebraic completeness theorems for both logics, defining and axiomatizing the corresponding algebraic semantics. We provide a representation for these algebras in terms of twist-structures, generalizing a known result ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Australasian Journal of Logic
سال: 2017
ISSN: 1448-5052
DOI: 10.26686/ajl.v14i1.4035